Cycle Index, Weight Enumerator, and Tutte Polynomial
نویسندگان
چکیده
منابع مشابه
Cycle Index, Weight Enumerator, and Tutte Polynomial
With every linear code is associated a permutation group whose cycle index is the weight enumerator of the code (up to a trivial normalisation). There is a class of permutation groups (the IBIS groups) which includes the groups obtained from codes as above. With every IBIS group is associated a matroid; in the case of a group from a code, the matroid differs only trivially from that which arise...
متن کاملCycle index generalises weight enumerator
With every linear code is associated a permutation group whose cycle index is the weight enumerator of the code (up to normalisation). There is a class of permutation groups (the IBIS groups) which includes the groups obtained from codes as above. With every IBIS group is associated a matroid; in the case of a code group, the matroid differs only trivially from that which arises from the code. ...
متن کاملPolynomial aspects of codes, matroids and permutation groups
Index 74 Preface The three subjects of the title (codes, matroids, and permutation groups) have many interconnections. In particular, in each case, there is a polynomial which captures a lot of information about the structure: we have the weight enumerator of a code, the Tutte polynomial (or rank polynomial) of a matroid, and the cycle index of a permutation group. With any code is associated a...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملThe Tutte polynomial
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2002
ISSN: 1077-8926
DOI: 10.37236/1663